Iterated relative recursive enumerability

Enumerability, decidability, computability - an introduction to the theory of recursive functions

Reading a book is also kind of better solution when you have no enough money or time to get your own adventure. This is one of the reasons we show the enumerability decidability computability an introduction to the theory of recursive functions as your friend in spending the time. For more representative collections, this book not only offers it's strategically book resource. It can be a good f...

Iterated Local Reeection Vs Iterated Consistency

For \natural enough" systems of ordinal notation we show that times iterated local reeection schema over a suuciently strong arithmetic T proves the same 0 1-sentences as ! times iterated consistency. A corollary is that the two hierarchies catch up modulo relative interpretability exactly at-numbers. We also derive the following more general \mixed" formulas estimating the consistency strength...

Domination, forcing, array nonrecursiveness and relative recursive enumerability

We present some abstract theorems showing how domination properties equivalent to not being GL2 or array recursive can be used to construct sets generic for di¤erent notions of forcing. These theorems are then applied to give simple proofs of several old results. We also give a direct uniform proof of a recent result of Ambos-Spies, Ding, Wang and Yu [2009] that every degree above any not in GL...

Iterated Relative Recursive Enummmerability

On structural similarities of finite automata and Turing machine enumerability classes

There are different ways of measuring the complexity of functions that map words to words. Well-known measures are time and space complexity. Enumerability is another possible measure. It is used in recursion theory, where it plays a key rôle in bounded query theory, but also in resource-bounded complexity theory, especially in connection with nonuniform computations. This dissertation transfer...